Recursion elimination with variable parameters
نویسندگان
چکیده
منابع مشابه
Boosting Search with Variable Elimination
Variable elimination is the basic step of Adaptive Consistency[4]. It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are many classes of problems for which it is infeasible, due to its exponential space and time complexity. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be e ective...
متن کاملContextual Variable Elimination with Overlapping Contexts
Belief networks (BNs) extracted from statistical relational learning formalisms often include variables with conditional probability distributions (CPDs) that exhibit a local structure (e.g, decision trees and noisy-or). In such cases, naively representing CPDs as tables and using a general purpose inference algorithm such as variable elimination (VE) results in redundant computation. Contextua...
متن کاملLifted Variable Elimination with Arbitrary Constraints
Lifted probabilistic inference algorithms exploit regularities in the structure of graphical models to perform inference more efficiently. More specifically, they identify groups of interchangeable variables and perform inference once for each group, as opposed to once for each variable. The groups are defined by means of constraints, so the flexibility of the grouping is determined by the expr...
متن کاملTransport with spatially variable kinetic sorption: recursion formulation
A recursion formulation for the transport of linearly sorbing solutes undergoing nonequilibrium sorption is developed. Constant or spatially varying sorption kinetics can be modeled using the recursion approach. The sorption and desorption rates are modeled as two independent random processes with a prescribed mean and covariance structure with spatial variability in the rate parameters include...
متن کاملUseless-Variable Elimination
1 Intro In my 1988 SIGPLAN paper “Control-Flow Analysis in Scheme,” I promised to cover several items in more detail in a “forthcoming tech report.” The tech report has yet to happen. Most of the promised items have been covered in other papers (“The Semantics of Scheme Control-Flow Analysis” and “Data-Flow Analysis and Type Recovery in Scheme”). Useless-variable elimination, however, is still ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1979
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/22.2.151